0.08/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.11	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.10/0.32	% Computer   : n029.cluster.edu
0.10/0.32	% Model      : x86_64 x86_64
0.10/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	% Memory     : 8042.1875MB
0.10/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 1200
0.10/0.32	% WCLimit    : 120
0.10/0.32	% DateTime   : Tue Jul 13 10:45:25 EDT 2021
0.10/0.32	% CPUTime    : 
0.10/0.32	% Number of cores: 8
0.10/0.32	% Python version: Python 3.6.8
0.10/0.32	# Version: 2.6rc1-ho
0.10/0.32	# No SInE strategy applied
0.10/0.32	# Trying AutoSched0 for 59 seconds
0.10/0.35	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.10/0.35	# and selection function SelectComplexExceptUniqMaxHorn.
0.10/0.35	#
0.10/0.35	# Preprocessing time       : 0.025 s
0.10/0.35	# Presaturation interreduction done
0.10/0.35	
0.10/0.35	# Proof found!
0.10/0.35	# SZS status Theorem
0.10/0.35	# SZS output start CNFRefutation
0.10/0.35	thf(cTHM409_3, conjecture, ~((((((((((((((((((((cP_1 @ b @ b&cP_1 @ c @ c)&![X1:$i]:cP_1 @ d @ X1)&![X1:$i, X2:$i]:(cP_1 @ (f @ X1) @ X2|~(cP_1 @ X1 @ X2)))&![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:(cQ_2 @ X4 @ X5 @ X6|~(cP_1 @ (f @ X3) @ X6)|~(cP_1 @ (f @ X2) @ X5)|~(cP_1 @ (f @ X1) @ X4)|~(cQ_1 @ X1 @ X2 @ X3)))&cP_2 @ a @ a)&![X1:$i]:cP_2 @ d @ X1)&![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:(~(cQ_2 @ X1 @ X2 @ X3)|~(cP_2 @ (f @ X2) @ X5)|cQ_3 @ X4 @ X5 @ X6|~(cP_2 @ (f @ X3) @ X6)|~(cP_2 @ (f @ X1) @ X4)))&cP_3 @ a @ a)&cP_3 @ c @ c)&![X1:$i]:cP_3 @ d @ X1)&![X1:$i, X2:$i]:(~(cP_3 @ X1 @ X2)|cP_3 @ (f @ X1) @ X2))&![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:(~(cP_3 @ (f @ X2) @ X5)|cQ_4 @ X4 @ X5 @ X6|~(cP_3 @ (f @ X3) @ X6)|~(cP_3 @ (f @ X1) @ X4)|~(cQ_3 @ X1 @ X2 @ X3)))&![X1:$i, X2:$i, X3:$i]:~(cQ_4 @ X1 @ X2 @ X3))&cP_3 @ b @ b)&![X1:$i, X2:$i]:(~(cP_2 @ X1 @ X2)|cP_2 @ (f @ X1) @ X2))&cP_2 @ c @ c)&cP_2 @ b @ b)&cP_1 @ a @ a)&cQ_1 @ a @ b @ c)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM409_3)).
0.10/0.35	thf(c_0_1, negated_conjecture, ~(~((((((((((((((((((((cP_1 @ b @ b&cP_1 @ c @ c)&![X1:$i]:cP_1 @ d @ X1)&![X1:$i, X2:$i]:(cP_1 @ (f @ X1) @ X2|~cP_1 @ X1 @ X2))&![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:(cQ_2 @ X4 @ X5 @ X6|~cP_1 @ (f @ X3) @ X6|~cP_1 @ (f @ X2) @ X5|~cP_1 @ (f @ X1) @ X4|~cQ_1 @ X1 @ X2 @ X3))&cP_2 @ a @ a)&![X1:$i]:cP_2 @ d @ X1)&![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:(~cQ_2 @ X1 @ X2 @ X3|~cP_2 @ (f @ X2) @ X5|cQ_3 @ X4 @ X5 @ X6|~cP_2 @ (f @ X3) @ X6|~cP_2 @ (f @ X1) @ X4))&cP_3 @ a @ a)&cP_3 @ c @ c)&![X1:$i]:cP_3 @ d @ X1)&![X1:$i, X2:$i]:(~cP_3 @ X1 @ X2|cP_3 @ (f @ X1) @ X2))&![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:(~cP_3 @ (f @ X2) @ X5|cQ_4 @ X4 @ X5 @ X6|~cP_3 @ (f @ X3) @ X6|~cP_3 @ (f @ X1) @ X4|~cQ_3 @ X1 @ X2 @ X3))&![X1:$i, X2:$i, X3:$i]:~cQ_4 @ X1 @ X2 @ X3)&cP_3 @ b @ b)&![X1:$i, X2:$i]:(~cP_2 @ X1 @ X2|cP_2 @ (f @ X1) @ X2))&cP_2 @ c @ c)&cP_2 @ b @ b)&cP_1 @ a @ a)&cQ_1 @ a @ b @ c))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM409_3])])).
0.10/0.35	thf(c_0_2, negated_conjecture, ![X37:$i, X38:$i, X39:$i, X40:$i, X41:$i, X42:$i, X43:$i, X44:$i, X45:$i, X46:$i, X47:$i, X48:$i, X49:$i, X50:$i, X51:$i, X52:$i, X53:$i, X54:$i, X55:$i, X56:$i, X57:$i, X58:$i, X59:$i, X60:$i, X61:$i, X62:$i, X63:$i, X64:$i, X65:$i, X66:$i]:(((((((((((((((((((cP_1 @ b @ b&cP_1 @ c @ c)&cP_1 @ d @ X37)&(cP_1 @ (f @ X38) @ X39|~cP_1 @ X38 @ X39))&(cQ_2 @ X43 @ X44 @ X45|~cP_1 @ (f @ X42) @ X45|~cP_1 @ (f @ X41) @ X44|~cP_1 @ (f @ X40) @ X43|~cQ_1 @ X40 @ X41 @ X42))&cP_2 @ a @ a)&cP_2 @ d @ X46)&(~cQ_2 @ X47 @ X48 @ X49|~cP_2 @ (f @ X48) @ X51|cQ_3 @ X50 @ X51 @ X52|~cP_2 @ (f @ X49) @ X52|~cP_2 @ (f @ X47) @ X50))&cP_3 @ a @ a)&cP_3 @ c @ c)&cP_3 @ d @ X53)&(~cP_3 @ X54 @ X55|cP_3 @ (f @ X54) @ X55))&(~cP_3 @ (f @ X57) @ X60|cQ_4 @ X59 @ X60 @ X61|~cP_3 @ (f @ X58) @ X61|~cP_3 @ (f @ X56) @ X59|~cQ_3 @ X56 @ X57 @ X58))&~cQ_4 @ X62 @ X63 @ X64)&cP_3 @ b @ b)&(~cP_2 @ X65 @ X66|cP_2 @ (f @ X65) @ X66))&cP_2 @ c @ c)&cP_2 @ b @ b)&cP_1 @ a @ a)&cQ_1 @ a @ b @ c), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])).
0.10/0.35	thf(c_0_3, negated_conjecture, ![X1:$i, X3:$i, X2:$i, X6:$i, X5:$i, X4:$i]:(cQ_2 @ X1 @ X2 @ X3|~cP_1 @ (f @ X4) @ X3|~cP_1 @ (f @ X5) @ X2|~cP_1 @ (f @ X6) @ X1|~cQ_1 @ X6 @ X5 @ X4), inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_4, negated_conjecture, ![X1:$i, X2:$i]:(cP_1 @ (f @ X1) @ X2|~cP_1 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_5, negated_conjecture, ![X3:$i, X2:$i, X1:$i, X4:$i, X6:$i, X5:$i]:(cQ_3 @ X5 @ X4 @ X6|~cQ_2 @ X1 @ X2 @ X3|~cP_2 @ (f @ X2) @ X4|~cP_2 @ (f @ X3) @ X6|~cP_2 @ (f @ X1) @ X5), inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_6, negated_conjecture, ![X1:$i, X2:$i]:(cP_2 @ (f @ X1) @ X2|~cP_2 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_7, negated_conjecture, ![X2:$i, X4:$i, X3:$i, X6:$i, X5:$i, X1:$i]:(cQ_2 @ X1 @ X2 @ X3|~cP_1 @ (f @ X4) @ X2|~cP_1 @ (f @ X5) @ X3|~cQ_1 @ X6 @ X4 @ X5|~cP_1 @ X6 @ X1), inference(spm,[status(thm)],[c_0_3, c_0_4])).
0.10/0.35	thf(c_0_8, negated_conjecture, ![X1:$i, X2:$i, X4:$i, X6:$i, X5:$i, X3:$i]:(cQ_3 @ X1 @ X2 @ X3|~cP_2 @ (f @ X4) @ X2|~cP_2 @ (f @ X5) @ X1|~cQ_2 @ X5 @ X4 @ X6|~cP_2 @ X6 @ X3), inference(spm,[status(thm)],[c_0_5, c_0_6])).
0.10/0.35	thf(c_0_9, negated_conjecture, ![X1:$i, X3:$i, X5:$i, X6:$i, X4:$i, X2:$i]:(cQ_2 @ X1 @ X2 @ X3|~cP_1 @ (f @ X4) @ X3|~cQ_1 @ X5 @ X6 @ X4|~cP_1 @ X5 @ X1|~cP_1 @ X6 @ X2), inference(spm,[status(thm)],[c_0_7, c_0_4])).
0.10/0.35	thf(c_0_10, negated_conjecture, ![X1:$i, X4:$i, X6:$i, X5:$i, X3:$i, X2:$i]:(cQ_3 @ X1 @ X2 @ X3|~cP_2 @ (f @ X4) @ X1|~cQ_2 @ X4 @ X5 @ X6|~cP_2 @ X6 @ X3|~cP_2 @ X5 @ X2), inference(spm,[status(thm)],[c_0_8, c_0_6])).
0.10/0.35	thf(c_0_11, negated_conjecture, ![X1:$i, X2:$i, X4:$i, X5:$i, X6:$i, X3:$i]:(cQ_2 @ X1 @ X2 @ X3|~cQ_1 @ X4 @ X5 @ X6|~cP_1 @ X4 @ X1|~cP_1 @ X5 @ X2|~cP_1 @ X6 @ X3), inference(spm,[status(thm)],[c_0_9, c_0_4])).
0.10/0.35	thf(c_0_12, negated_conjecture, cQ_1 @ a @ b @ c, inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_13, negated_conjecture, ![X4:$i, X3:$i, X2:$i, X1:$i, X6:$i, X5:$i]:(cQ_4 @ X3 @ X2 @ X4|~cP_3 @ (f @ X1) @ X2|~cP_3 @ (f @ X5) @ X4|~cP_3 @ (f @ X6) @ X3|~cQ_3 @ X6 @ X1 @ X5), inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_14, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:~cQ_4 @ X1 @ X2 @ X3, inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_15, negated_conjecture, ![X2:$i, X6:$i, X5:$i, X4:$i, X3:$i, X1:$i]:(cQ_3 @ X1 @ X2 @ X3|~cQ_2 @ X4 @ X5 @ X6|~cP_2 @ X6 @ X3|~cP_2 @ X5 @ X2|~cP_2 @ X4 @ X1), inference(spm,[status(thm)],[c_0_10, c_0_6])).
0.10/0.35	thf(c_0_16, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(cQ_2 @ X1 @ X2 @ X3|~cP_1 @ a @ X1|~cP_1 @ b @ X2|~cP_1 @ c @ X3), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.10/0.35	thf(c_0_17, negated_conjecture, ![X2:$i, X1:$i, X4:$i, X6:$i, X5:$i, X3:$i]:(~cP_3 @ (f @ X1) @ X2|~cP_3 @ (f @ X3) @ X4|~cP_3 @ (f @ X5) @ X6|~cQ_3 @ X1 @ X5 @ X3), inference(sr,[status(thm)],[c_0_13, c_0_14])).
0.10/0.35	thf(c_0_18, negated_conjecture, ![X1:$i, X2:$i]:(cP_3 @ (f @ X1) @ X2|~cP_3 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_19, negated_conjecture, ![X2:$i, X6:$i, X5:$i, X4:$i, X3:$i, X1:$i]:(cQ_3 @ X1 @ X2 @ X3|~cP_1 @ a @ X4|~cP_1 @ b @ X5|~cP_1 @ c @ X6|~cP_2 @ X6 @ X3|~cP_2 @ X5 @ X2|~cP_2 @ X4 @ X1), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.10/0.35	thf(c_0_20, negated_conjecture, cP_1 @ a @ a, inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_21, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X2:$i, X5:$i, X6:$i]:(~cP_3 @ (f @ X1) @ X2|~cP_3 @ (f @ X3) @ X4|~cQ_3 @ X5 @ X3 @ X1|~cP_3 @ X5 @ X6), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.10/0.35	thf(c_0_22, negated_conjecture, ![X1:$i, X5:$i, X4:$i, X3:$i, X2:$i]:(cQ_3 @ X1 @ X2 @ X3|~cP_1 @ b @ X4|~cP_1 @ c @ X5|~cP_2 @ a @ X1|~cP_2 @ X5 @ X3|~cP_2 @ X4 @ X2), inference(spm,[status(thm)],[c_0_19, c_0_20])).
0.10/0.35	thf(c_0_23, negated_conjecture, cP_1 @ b @ b, inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_24, negated_conjecture, ![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:(~cP_3 @ (f @ X1) @ X2|~cQ_3 @ X3 @ X1 @ X4|~cP_3 @ X3 @ X5|~cP_3 @ X4 @ X6), inference(spm,[status(thm)],[c_0_21, c_0_18])).
0.10/0.35	thf(c_0_25, negated_conjecture, ![X1:$i, X2:$i, X4:$i, X3:$i]:(cQ_3 @ X1 @ X2 @ X3|~cP_1 @ c @ X4|~cP_2 @ a @ X1|~cP_2 @ b @ X2|~cP_2 @ X4 @ X3), inference(spm,[status(thm)],[c_0_22, c_0_23])).
0.10/0.35	thf(c_0_26, negated_conjecture, cP_1 @ c @ c, inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_27, negated_conjecture, ![X1:$i, X3:$i, X2:$i, X4:$i, X5:$i, X6:$i]:(~cQ_3 @ X1 @ X2 @ X3|~cP_3 @ X1 @ X4|~cP_3 @ X3 @ X5|~cP_3 @ X2 @ X6), inference(spm,[status(thm)],[c_0_24, c_0_18])).
0.10/0.35	thf(c_0_28, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(cQ_3 @ X1 @ X2 @ X3|~cP_2 @ a @ X1|~cP_2 @ b @ X2|~cP_2 @ c @ X3), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.10/0.35	thf(c_0_29, negated_conjecture, ![X1:$i, X3:$i, X2:$i, X4:$i, X5:$i, X6:$i]:(~cP_2 @ a @ X1|~cP_2 @ b @ X2|~cP_2 @ c @ X3|~cP_3 @ X1 @ X4|~cP_3 @ X3 @ X5|~cP_3 @ X2 @ X6), inference(spm,[status(thm)],[c_0_27, c_0_28])).
0.10/0.35	thf(c_0_30, negated_conjecture, cP_2 @ a @ a, inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_31, negated_conjecture, ![X2:$i, X1:$i, X3:$i, X4:$i, X5:$i]:(~cP_2 @ b @ X1|~cP_2 @ c @ X2|~cP_3 @ a @ X3|~cP_3 @ X2 @ X4|~cP_3 @ X1 @ X5), inference(spm,[status(thm)],[c_0_29, c_0_30])).
0.10/0.35	thf(c_0_32, negated_conjecture, cP_2 @ b @ b, inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_33, negated_conjecture, ![X1:$i, X2:$i, X3:$i, X4:$i]:(~cP_2 @ c @ X1|~cP_3 @ a @ X2|~cP_3 @ b @ X3|~cP_3 @ X1 @ X4), inference(spm,[status(thm)],[c_0_31, c_0_32])).
0.10/0.35	thf(c_0_34, negated_conjecture, cP_2 @ c @ c, inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_35, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(~cP_3 @ a @ X1|~cP_3 @ b @ X2|~cP_3 @ c @ X3), inference(spm,[status(thm)],[c_0_33, c_0_34])).
0.10/0.35	thf(c_0_36, negated_conjecture, cP_3 @ a @ a, inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_37, negated_conjecture, ![X1:$i, X2:$i]:(~cP_3 @ b @ X1|~cP_3 @ c @ X2), inference(spm,[status(thm)],[c_0_35, c_0_36])).
0.10/0.35	thf(c_0_38, negated_conjecture, cP_3 @ b @ b, inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_39, negated_conjecture, cP_3 @ c @ c, inference(split_conjunct,[status(thm)],[c_0_2])).
0.10/0.35	thf(c_0_40, negated_conjecture, ![X1:$i]:~cP_3 @ c @ X1, inference(spm,[status(thm)],[c_0_37, c_0_38])).
0.10/0.35	thf(c_0_41, negated_conjecture, ($false), inference(sr,[status(thm)],[c_0_39, c_0_40]), ['proof']).
0.10/0.35	# SZS output end CNFRefutation
0.10/0.35	# Proof object total steps             : 42
0.10/0.35	# Proof object clause steps            : 39
0.10/0.35	# Proof object formula steps           : 3
0.10/0.35	# Proof object conjectures             : 42
0.10/0.35	# Proof object clause conjectures      : 39
0.10/0.35	# Proof object formula conjectures     : 3
0.10/0.35	# Proof object initial clauses used    : 17
0.10/0.35	# Proof object initial formulas used   : 1
0.10/0.35	# Proof object generating inferences   : 20
0.10/0.35	# Proof object simplifying inferences  : 2
0.10/0.35	# Training examples: 0 positive, 0 negative
0.10/0.35	# Parsed axioms                        : 13
0.10/0.35	# Removed by relevancy pruning/SinE    : 0
0.10/0.35	# Initial clauses                      : 32
0.10/0.35	# Removed in clause preprocessing      : 12
0.10/0.35	# Initial clauses in saturation        : 20
0.10/0.35	# Processed clauses                    : 60
0.10/0.35	# ...of these trivial                  : 0
0.10/0.35	# ...subsumed                          : 0
0.10/0.35	# ...remaining for further processing  : 60
0.10/0.35	# Other redundant clauses eliminated   : 0
0.10/0.35	# Clauses deleted for lack of memory   : 0
0.10/0.35	# Backward-subsumed                    : 1
0.10/0.35	# Backward-rewritten                   : 0
0.10/0.35	# Generated clauses                    : 21
0.10/0.35	# ...of the previous two non-trivial   : 20
0.10/0.35	# Contextual simplify-reflections      : 0
0.10/0.35	# Paramodulations                      : 20
0.10/0.35	# Factorizations                       : 0
0.10/0.35	# NegExts                              : 0
0.10/0.35	# Equation resolutions                 : 0
0.10/0.35	# Propositional unsat checks           : 0
0.10/0.35	#    Propositional check models        : 0
0.10/0.35	#    Propositional check unsatisfiable : 0
0.10/0.35	#    Propositional clauses             : 0
0.10/0.35	#    Propositional clauses after purity: 0
0.10/0.35	#    Propositional unsat core size     : 0
0.10/0.35	#    Propositional preprocessing time  : 0.000
0.10/0.35	#    Propositional encoding time       : 0.000
0.10/0.35	#    Propositional solver time         : 0.000
0.10/0.35	#    Success case prop preproc time    : 0.000
0.10/0.35	#    Success case prop encoding time   : 0.000
0.10/0.35	#    Success case prop solver time     : 0.000
0.10/0.35	# Current number of processed clauses  : 38
0.10/0.35	#    Positive orientable unit clauses  : 12
0.10/0.35	#    Positive unorientable unit clauses: 0
0.10/0.35	#    Negative unit clauses             : 2
0.10/0.35	#    Non-unit-clauses                  : 24
0.10/0.35	# Current number of unprocessed clauses: 0
0.10/0.35	# ...number of literals in the above   : 0
0.10/0.35	# Current number of archived formulas  : 0
0.10/0.35	# Current number of archived clauses   : 22
0.10/0.35	# Clause-clause subsumption calls (NU) : 107
0.10/0.35	# Rec. Clause-clause subsumption calls : 46
0.10/0.35	# Non-unit clause-clause subsumptions  : 1
0.10/0.35	# Unit Clause-clause subsumption calls : 9
0.10/0.35	# Rewrite failures with RHS unbound    : 0
0.10/0.35	# BW rewrite match attempts            : 0
0.10/0.35	# BW rewrite match successes           : 0
0.10/0.35	# Condensation attempts                : 0
0.10/0.35	# Condensation successes               : 0
0.10/0.35	# Termbank termtop insertions          : 2645
0.10/0.35	
0.10/0.35	# -------------------------------------------------
0.10/0.35	# User time                : 0.025 s
0.10/0.35	# System time              : 0.005 s
0.10/0.35	# Total time               : 0.030 s
0.10/0.35	# Maximum resident set size: 1648 pages
0.10/0.35	EOF